On the Error Exponents of Some Improved Tangential-Sphere Bounds
نویسندگان
چکیده
The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the tangential-sphere bound (TSB) and some of its improved variations. The paper focuses on the derivation of the error exponents of these bounds. Although it was previously exemplified that some variations of the TSB suggest an improvement over the TSB for finite-length codes, it is demonstrated in this paper that all of these bounds possess the same error exponent. Their common value is equal to the error exponent of the TSB, where the latter error exponent was previously derived by Poltyrev and Divsalar.
منابع مشابه
Quantum Sphere-Packing Bounds with Polynomial Prefactors
We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...
متن کاملTangential Sphere Bounds on the Ensemble Performance of ML Decoded Low Density Parity Check Codes
Low density parity check (LDPC) codes were rediscovered by MacKay and Neal [4], after being first introduced in 1961 by Gallager in his seminal work [2, 3]. The experiments with LDPC codes, indicate that like turbo codes [1], they exhibit low bit error rates at low signal to noise ratios. The performance of LDPC codes was extensively investigated since and their exceptional performance with the...
متن کاملUpper Bounds On the ML Decoding Error Probability of General Codes over AWGN Channels
In this paper, parameterized Gallager’s first bounding technique (GFBT) is presented by introducing nested Gallager regions, to derive upper bounds on the ML decoding error probability of general codes over AWGN channels. The three well-known bounds, namely, the sphere bound (SB) of Herzberg and Poltyrev, the tangential bound (TB) of Berlekamp, and the tangential-sphere bound (TSB) of Poltyrev,...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES List Decoding − Random Coding Exponents and Expurgated Exponents
Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size L. Two asymptotic regimes are considered, the fixed list–size regime, where L is fixed independently of the block length n, and the exponential list–size, where L grows exponentially with n. We first derive a general upper bound on the list–decoding ave...
متن کاملImproved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
The ensemble performance of parallel and serial concatenated turbo codes is considered, where the ensemble is generated by a uniform choice of the interleaver and of the component codes taken from the set of time varying recursive systematic convolutional codes. Following the derivation of the input-output weight enumeration functions of the ensembles of random parallel and serial concatenated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0607004 شماره
صفحات -
تاریخ انتشار 2006